DFT Domain Characterization of Quasi-Cyclic Codes
نویسندگان
چکیده
منابع مشابه
Fq-Linear Cyclic Codes over Fq: DFT Characterization
Codes over Fqm that form vector spaces over Fq are called Fq-linear codes over Fqm . Among these we consider only cyclic codes and call them Fq-linear cyclic codes (FqLC codes) over Fqm . This class of codes includes as special cases (i) group cyclic codes over elementary abelian groups (q = p, a prime), (ii) subspace subcodes of Reed-Solomon codes and (iii) linear cyclic codes over Fq (m=1). T...
متن کاملQuasi-cyclic subcodes of cyclic codes
We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the si...
متن کاملQuasi-cyclic dyadic codes in the Walsh--Hadamard transform domain
A code is -quasi-cyclic ( -QC) if there is an integer such that cyclic shift of a codeword by -positions is also a codeword. For = 1, cyclic codes are obtained. A dyadic code is a code which is closed under all dyadic shifts. An -QC dyadic ( -QCD) code is one which is both -QC and dyadic. QCD codes with = 1 give codes that are cyclic and dyadic (CD). In this correspondence, we obtain a simple c...
متن کاملOn quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کاملon the girth of tanner (3,7) quasi-cyclic ldpc codes
s. kim et al. have been analyzed the girth of some algebraically structured quasi-cyclic (qc) low-density parity-check (ldpc) codes, i.e. tanner $(3,5)$ of length $5p$, where $p$ is a prime of the form $15m+1$. in this paper, by extension this method to tanner $(3,7)$ codes of length $7p$, where $p$ is a prime of the form $21m+ 1$, the girth values of tanner $(3,7...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2003
ISSN: 0938-1279,1432-0622
DOI: 10.1007/s00200-003-0117-5